1991C - Absolute Zero - CodeForces Solution


constructive algorithms math

Please click on ads to support us..

Python Code:

n= int(input())
for i in range(n):
    m= int(input())
    l=list(map(int,input().split()))
    ans =[]
    for j in range(40):
        num = (min(l)+max(l))//2
        if num==0:
            break 
        for t in range(m):
            l[t] =abs(l[t]-num)
        ans.append(num)
    if l==[0]*m:
        print(len(ans))
        print(*ans,sep=" ")
    else:
        print(-1)


Comments

Submit
0 Comments
More Questions

145. Binary Tree Postorder Traversal
94. Binary Tree Inorder Traversal
101. Symmetric Tree
77. Combinations
46. Permutations
226. Invert Binary Tree
112. Path Sum
1556A - A Variety of Operations
136. Single Number
169. Majority Element
119. Pascal's Triangle II
409. Longest Palindrome
1574A - Regular Bracket Sequences
1574B - Combinatorics Homework
1567A - Domino Disaster
1593A - Elections
1607A - Linear Keyboard
EQUALCOIN Equal Coins
XOREQN Xor Equation
MAKEPAL Weird Palindrome Making
HILLSEQ Hill Sequence
MAXBRIDGE Maximise the bridges
WLDRPL Wildcard Replacement
1221. Split a String in Balanced Strings
1002. Find Common Characters
1602A - Two Subsequences
1555A - PizzaForces
1607B - Odd Grasshopper
1084A - The Fair Nut and Elevator
1440B - Sum of Medians